16 research outputs found
Generalizing Informed Sampling for Asymptotically Optimal Sampling-based Kinodynamic Planning via Markov Chain Monte Carlo
Asymptotically-optimal motion planners such as RRT* have been shown to
incrementally approximate the shortest path between start and goal states. Once
an initial solution is found, their performance can be dramatically improved by
restricting subsequent samples to regions of the state space that can
potentially improve the current solution. When the motion planning problem lies
in a Euclidean space, this region , called the informed set, can be
sampled directly. However, when planning with differential constraints in
non-Euclidean state spaces, no analytic solutions exists to sampling
directly.
State-of-the-art approaches to sampling in such domains such as
Hierarchical Rejection Sampling (HRS) may still be slow in high-dimensional
state space. This may cause the planning algorithm to spend most of its time
trying to produces samples in rather than explore it. In this paper,
we suggest an alternative approach to produce samples in the informed set
for a wide range of settings. Our main insight is to recast this
problem as one of sampling uniformly within the sub-level-set of an implicit
non-convex function. This recasting enables us to apply Monte Carlo sampling
methods, used very effectively in the Machine Learning and Optimization
communities, to solve our problem. We show for a wide range of scenarios that
using our sampler can accelerate the convergence rate to high-quality solutions
in high-dimensional problems
Where to Map? Iterative Rover-Copter Path Planning for Mars Exploration
In addition to conventional ground rovers, the Mars 2020 mission will send a
helicopter to Mars. The copter's high-resolution data helps the rover to
identify small hazards such as steps and pointy rocks, as well as providing
rich textual information useful to predict perception performance. In this
paper, we consider a three-agent system composed of a Mars rover, copter, and
orbiter. The objective is to provide good localization to the rover by
selecting an optimal path that minimizes the localization uncertainty
accumulation during the rover's traverse. To achieve this goal, we quantify the
localizability as a goodness measure associated with the map, and conduct a
joint-space search over rover's path and copter's perceptual actions given
prior information from the orbiter. We jointly address where to map by the
copter and where to drive by the rover using the proposed iterative
copter-rover path planner. We conducted numerical simulations using the map of
Mars 2020 landing site to demonstrate the effectiveness of the proposed
planner.Comment: 8 pages, 7 figure
Toward Specification-Guided Active Mars Exploration for Cooperative Robot Teams
As a step towards achieving autonomy in space exploration missions, we consider a cooperative robotics system consisting of a copter and a rover. The goal of the copter is to explore an unknown environment so as to maximize knowledge about a science mission expressed in linear temporal logic that is to be executed by the rover. We model environmental uncertainty as a belief space Markov decision process and formulate the problem as a two-step stochastic dynamic program that we solve in a way that leverages the decomposed nature of the overall system. We demonstrate in simulations that the robot team makes intelligent decisions in the face of uncertainty
Bayesian Learning-Based Adaptive Control for Safety Critical Systems
Deep learning has enjoyed much recent success, and applying state-of-the-art
model learning methods to controls is an exciting prospect. However, there is a
strong reluctance to use these methods on safety-critical systems, which have
constraints on safety, stability, and real-time performance. We propose a
framework which satisfies these constraints while allowing the use of deep
neural networks for learning model uncertainties. Central to our method is the
use of Bayesian model learning, which provides an avenue for maintaining
appropriate degrees of caution in the face of the unknown. In the proposed
approach, we develop an adaptive control framework leveraging the theory of
stochastic CLFs (Control Lyapunov Functions) and stochastic CBFs (Control
Barrier Functions) along with tractable Bayesian model learning via Gaussian
Processes or Bayesian neural networks. Under reasonable assumptions, we
guarantee stability and safety while adapting to unknown dynamics with
probability 1. We demonstrate this architecture for high-speed terrestrial
mobility targeting potential applications in safety-critical high-speed Mars
rover missions.Comment: Corrected an error in section II, where previously the problem was
introduced in a non-stochastic setting and wrongly assumed the solution to an
ODE with Gaussian distributed parametric uncertainty was equivalent to an SDE
with a learned diffusion term. See Lew, T et al. "On the Problem of
Reformulating Systems with Uncertain Dynamics as a Stochastic Differential
Equation
Autonomous Hybrid Ground/Aerial Mobility in Unknown Environments
Hybrid ground and aerial vehicles can possess distinct advantages over
ground-only or flight-only designs in terms of energy savings and increased
mobility. In this work we outline our unified framework for controls, planning,
and autonomy of hybrid ground/air vehicles. Our contribution is three-fold: 1)
We develop a control scheme for the control of passive two-wheeled hybrid
ground/aerial vehicles. 2) We present a unified planner for both rolling and
flying by leveraging differential flatness mappings. 3) We conduct experiments
leveraging mapping and global planning for hybrid mobility in unknown
environments, showing that hybrid mobility uses up to five times less energy
than flying only
NeBula: TEAM CoSTAR’s robotic autonomy solution that won phase II of DARPA subterranean challenge
This paper presents and discusses algorithms, hardware, and software architecture developed by the TEAM CoSTAR (Collaborative SubTerranean Autonomous Robots), competing in the DARPA Subterranean Challenge. Specifically, it presents the techniques utilized within the Tunnel (2019) and Urban (2020) competitions, where CoSTAR achieved second and first place, respectively. We also discuss CoSTAR’s demonstrations in Martian-analog surface and subsurface (lava tubes) exploration. The paper introduces our autonomy solution, referred to as NeBula (Networked Belief-aware Perceptual Autonomy). NeBula is an uncertainty-aware framework that aims at enabling resilient and modular autonomy solutions by performing reasoning and decision making in the belief space (space of probability distributions over the robot and world states). We discuss various components of the NeBula framework, including (i) geometric and semantic environment mapping, (ii) a multi-modal positioning system, (iii) traversability analysis and local planning, (iv) global motion planning and exploration behavior, (v) risk-aware mission planning, (vi) networking and decentralized reasoning, and (vii) learning-enabled adaptation. We discuss the performance of NeBula on several robot types (e.g., wheeled, legged, flying), in various environments. We discuss the specific results and lessons learned from fielding this solution in the challenging courses of the DARPA Subterranean Challenge competition.Peer ReviewedAgha, A., Otsu, K., Morrell, B., Fan, D. D., Thakker, R., Santamaria-Navarro, A., Kim, S.-K., Bouman, A., Lei, X., Edlund, J., Ginting, M. F., Ebadi, K., Anderson, M., Pailevanian, T., Terry, E., Wolf, M., Tagliabue, A., Vaquero, T. S., Palieri, M., Tepsuporn, S., Chang, Y., Kalantari, A., Chavez, F., Lopez, B., Funabiki, N., Miles, G., Touma, T., Buscicchio, A., Tordesillas, J., Alatur, N., Nash, J., Walsh, W., Jung, S., Lee, H., Kanellakis, C., Mayo, J., Harper, S., Kaufmann, M., Dixit, A., Correa, G. J., Lee, C., Gao, J., Merewether, G., Maldonado-Contreras, J., Salhotra, G., Da Silva, M. S., Ramtoula, B., Fakoorian, S., Hatteland, A., Kim, T., Bartlett, T., Stephens, A., Kim, L., Bergh, C., Heiden, E., Lew, T., Cauligi, A., Heywood, T., Kramer, A., Leopold, H. A., Melikyan, H., Choi, H. C., Daftry, S., Toupet, O., Wee, I., Thakur, A., Feras, M., Beltrame, G., Nikolakopoulos, G., Shim, D., Carlone, L., & Burdick, JPostprint (published version